Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
181	1. Statement of the big problem: Is there a clear statement of the big question? Is it a good big question? Identify the reasons why there is (or isn’t) confidence that the big question is tractable. You should think h Add to Reading List Source URL: earthweb.ess.washington.edu Language: English - Date: 2006-05-07 15:12:56 Knowledge Science studies Problem statement Falsifiability Scientific method Dynamic programming Computational complexity theory Science Problem solving Philosophy of science
182	Interactive proofs with competing teams of no-signaling provers Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-07-24 10:11:20 NEXPTIME IP NP Soundness KeY Logic programming Interactive proof system Zero-knowledge proof Theoretical computer science Applied mathematics Complexity classes
183	1 Efficient Reasoning about Data Trees via Integer Linear Programming CLAIRE DAVID, Universit´e Paris-Est LEONID LIBKIN, University of Edinburgh TONY TAN, University of Edinburgh Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-27 14:06:25 Electronic design automation Formal methods Logic in computer science NP-complete problems Complexity classes Satisfiability Modulo Theories Symbol Boolean satisfiability problem P-complete Theoretical computer science Computational complexity theory Applied mathematics
184	A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set Marek Karpinski1 ? , Andrzej Lingas2 1 ?? Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2015-02-23 03:33:24 Geometry Spanning tree Polygons Catalan number Dynamic programming Simple polygon Time complexity Polygon triangulation Delaunay triangulation Mathematics Theoretical computer science Triangulation
185	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
186	LSA 354: Statistical Parsing: Problem Set [Some of these problems are borrowed with thanks from Michael Collins and Regina Barzilay.] Question 1 Let’s use a very simple grammar (where S is the start symbol, and termina Add to Reading List Source URL: nlp.stanford.edu Language: English - Date: 2007-07-10 03:17:11 Theoretical computer science Compiler construction Programming language implementation Bioinformatics Stochastic context-free grammar Complexity classes Left corner Parse tree Parsing Formal languages Linguistics Statistical natural language processing
187	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
188	Microsoft PowerPoint - rico13l.pptx Add to Reading List Source URL: davidfrico.com Language: English - Date: 2013-10-01 20:01:40 Software Cyclomatic complexity Agile software development Code coverage Continuous integration Complexity Source lines of code Programming complexity Weighted Micro Function Points Software metrics Software engineering Software development
189	Mordechai (Moti) Ben-Ari Education • Ph.D. Tel Aviv University, Mathematics (Computer Science), 1981. Thesis: Complexity of Proofs and Models in Programming Logics. Advisors: Amir Pnueli and Zvi Galil. Add to Reading List Source URL: www.weizmann.ac.il Language: English - Date: 2014-07-30 05:41:34 Academia Science and technology in Israel Amir Pnueli Weizmann Institute of Science Ehud Shapiro SIGCSE Department of Computer Science Year of birth missing Mordechai Ben-Ari Computer science
190	From Small Space to Small Width in Resolution Yuval Filmus1 , Massimo Lauria2 , Mladen Mikša2 , Jakob Nordström2 , and Marc Vinyals2 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-01-09 15:51:16 Logic Logic in computer science Propositional calculus Rules of inference Logic programming Resolution Conjunctive normal form Unit propagation Proof complexity Theoretical computer science Automated theorem proving Mathematical logic